首页> 外文OA文献 >Setting the parameters right for two-hop IEEE 802.11e ad hoc networks
【2h】

Setting the parameters right for two-hop IEEE 802.11e ad hoc networks

机译:为两跳IEEE 802.11e ad hoc网络正确设置参数

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Two-hop ad-hoc networks, in which some nodes forward traffic for multiple sources, with which they also compete for channel access suffer from large queues building up in bottleneck nodes. This problem can often be alleviated by using IEEE 802.11e to give preferential treatment to bottleneck nodes. Previous results have shown that differentiation parameters can be used to allocate capacity in a more efficient way in the two-hop scenario. However, the overall throughput of the bottleneck may differ considerably, depending on the differentiation method used. By applying a very fast and accurate analysis method, based on steady-state analysis of an QBD-type infinite Markov chain, we find the maximum throughput that is possible per differentiation parameter. All possible parameter settings are explored with respect to the maximum throughput conditioned on a maximum buffer occupancy. This design space exploration cannot be done with network simulators like NS2 or Opnet, as each simulation run simply takes to long. The results, which have been validated by detailed simulations, show that by differentiating TXOP it is possible to achieve a throughput that is about 50% larger than when differentiating AIFS and CW_min.
机译:两跳自组织网络,其中某些节点将流量转发到多个源,并且它们还与之竞争信道访问,这是因为瓶颈节点中会堆积大量队列。通常可以通过使用IEEE 802.11e优先处理瓶颈节点来缓解此问题。先前的结果表明,在两跳方案中,可以使用差分参数以更有效的方式分配容量。但是,瓶颈的总吞吐量可能会有所不同,具体取决于所使用的区分方法。通过应用非常快速和准确的分析方法,基于对QBD型无限马尔可夫链的稳态分析,我们找到了每个微分参数可能的最大吞吐量。关于最大缓冲区占用情况下的最大吞吐量,探讨了所有可能的参数设置。这种设计空间的探索无法使用NS2或Opnet之类的网络模拟器完成,因为每次模拟运行都需要很长时间。通过详细仿真验证的结果表明,与区分AIFS和CW_min相比,通过区分TXOP可以实现大约50%的吞吐量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号